SOME ALGEBRA FOR THE EXPONENTIAL-GAMMA PROCESS

Some Finite-Graph Models for Process Algebra

In this paper, we present a number of closely related models of process algebra [2, 3, 4], called finite-graph models. In a finite-graph model of process algebra, each process is a bisimulafion class of a particular kind of process graphs, called recursive process graphs. Just as in the standard graph model [I], each guarded recursive specification has exactly one solution in a finite-graph mod...

Retracing Some Paths in Process Algebra

The very existence of the concur conference bears witness to the fact that “concurrency theory” has developed into a subject unto itself, with substantially different emphases and techniques to those prominent elsewhere in the semantics of computation. Whatever the past merits of this separate development, it seems timely to look for some convergence and unification. In addressing these issues,...

Exponential Polynomials, Stirling Numbers, and Evaluation of Some Gamma Integrals

and Applied Analysis 3 and continuing like that to S8. For large n this method is not convenient. However, later that year Ligowski 4 suggested a better method, providing a generating function for the numbers Sn: e z ∞ ∑ k 0 e k! ∞ ∑ k 0 ∞ ∑ n 0 k k! z n! ∞ ∑ n 0 Sn z n! . 2.4 Further, an effective iteration formula was found Sn n−1 ∑ j 0 ( n − 1 j ) Sj 2.5 by which every Sn can be evaluated st...

Probabilistic Process Algebra Probabilistic Process Algebra

On Some Properties of the Max Algebra System Over Tensors

Recently we generalized the max algebra system to the class of nonnegative  tensors. In this paper we give some basic properties for the left (right) inverse, under the new system. The existence of order 2 left (right) inverse of tensors is characterized. Also we generalize the direct product of matrices to the direct product of tensors (of the same order, but may be different dimensions) and i...